in this paper, three-stage assembly flowshop scheduling is considered with respect to minimizing bi-objectives, namely mean flow time and mean tardiness. this problem is a model of production systems, which several production operations are done simultaneously and independently, and then produced components are collected and transferred to an assembly stage for the final operation. in this mode...

this paper presents a new mathematical model for the problem of scheduling part families and jobs within each part family in a flow line manufacturing cell where the setup times for each family are sequence dependent and it is desired to minimize the maximum completion time of the last job on the last machine (makespan) while processing parts (jobs) in each family together. gaining an optimal s...

Maritime transportation plays a critical role in global trade as it accounts for over 80% of all merchandise movement. Given the growing volume maritime freight, is vital to have an efficient system handling ships and cargos at ports. The current first-come-first-serve method insufficient maintaining operational efficiency, especially under complicated conditions such parallel scheduling with d...

We consider the problem of scheduling jobs in a hybrid job shop We use the term hybrid to indicate that we consider a lot of extensions of the classic job shop such as transportation times multiple resources and setup times The Shifting Bottleneck procedure can be generalized to deal with those extensions We test this approach for an assembly shop In this shop we study the in uence of static an...

As environmental awareness grows, energy-aware scheduling is attracting increasing attention. Compared with traditional flexible job shop problem (FJSP), FJSP, considering sequence-dependent setup times and transportation (FJSP-SDST-T), closer to real production. In existing research, little research has focused on FJSP-SDST-T the minimization energy consumption. order make up gap, a mixed inte...

abstract: this paper considers the problem of scheduling n jobs on m unrelated parallel machines with sequence-dependent setup times. to better comply with industrial situations, jobs have varying due dates and ready times and there are some precedence relations between them. furthermore sequence-dependent setup times and anticipatory setups are included in the proposed model. the objective is ...